Visible Nearest Neighbor Queries
نویسندگان
چکیده
We introduce the visible k nearest neighbor (VkNN) query, which finds the k nearest objects that are visible to a query point. We also propose an algorithm to efficiently process the VkNN query. We compute the visible neighbors incrementally as we enlarge the search space. Our algorithm dramatically reduces the search cost compared to existing methods that require the computation of the visibility of all objects in advance. With extensive experiments, we show that our algorithm to process the VkNN query outperform the existing algorithms significantly.
منابع مشابه
Ranked Continuous Visible Nearest Neighbor Search
Physical obstacles (e.g., buildings, hills, and blindages, etc.) are ubiquitous in the real world, and their existence may affect the visibility between objects and thus the result of spatial queries such as range query, nearest neighbor search, and spatial join, etc. In this paper, we study a novel type of spatial queries, namely, ranked continuous visible nearest neighbor (RCVNN) search, whic...
متن کاملContinuous visible k nearest neighbor query on moving objects
A visible k nearest neighbor (Vk NN) query retrieves k objects that are visible and nearest to the query object, where “visible”means that there is no obstacle between an object and the query object. Existing studies on the Vk NN query have focused on static data objects. In this paper we investigate how to process the query on moving objects continuously. We queries. We exploit spatial proximi...
متن کاملSearch Space Reductions for Nearest-Neighbor Queries
The vast number of applications featuring multimedia and geometric data has made the R-tree a ubiquitous data structure in databases. A popular and fundamental operation on R-trees is nearest neighbor search. While nearest neighbor on R-trees has received considerable experimental attention, it has received somewhat less theoretical consideration. We study pruning heuristics for nearest neighbo...
متن کاملLUCK: Partitioned Processing of Continuous Nearest Neighbor Queries for Moving Objects
We study continuous K nearest neighbor queries over moving objects. LUCK stands for Lazy Update algorithm for processing Continuous K-nearest neighbor queries.
متن کاملConstrained Nearest Neighbor Queries
In this paper we introduce the notion of constrained nearest neighbor queries (CNN) and propose a series of methods to answer them. This class of queries can be thought of as nearest neighbor queries with range constraints. Although both nearest neighbor and range queries have been analyzed extensively in previous literature, the implications of constrained nearest neighbor queries have not bee...
متن کامل